Notes 10 : List Decoding Reed - Solomon Codes and Concatenated codes
نویسنده
چکیده
DRAFT Last class, we saw a toy version of recovering from a mixture of two Reed-Solomon codewords the two polynomials in question. Now we turn to list decoding arbitrary received words with a bounded distance from the Reed-Solomon code using Sudan’s [6] algorithm. This algorithm decodes close to a fraction 1 of errors for low rates. Then we will see an improvement by Guruswami and Sudan [4] which list decoded up to the Johnson radius.
منابع مشابه
Decoding Concatenated Codes using Soft Information
We present a decoding algorithm for concatenated codes when the outer code is a Reed-Solomon code and the inner code is arbitrary. “Soft” information on the reliability of various symbols is passed by the inner decodings and exploited in the Reed-Solomon decoding. This is the first analysis of such a soft algorithm that works for arbitrary inner codes; prior analyses could only handle some spec...
متن کاملCyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate
Algebraic error-correcting codes that achieve the optimal trade-off between rate and fraction of errors corrected (in the model of list decoding) were recently constructed by a careful “folding” of the Reed-Solomon code. The “low-degree” nature of this folding operation was crucial to the list decoding algorithm. We show how such folding schemes useful for list decoding arise out of the Artin-F...
متن کاملSoft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...
متن کاملCollaborative Decoding of Interleaved Reed-Solomon Codes using Gaussian Elimination
We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.
متن کاملList decoding of binary codes
We briefly survey some recent progress on list decoding algorithms for binary codes. The results discussed include: – Algorithms to list decode binary Reed-Muller codes of any order up to the minimum distance, generalizing the classical GoldreichLevin algorithm for RM codes of order 1 (Hadamard codes). These algorithms are “local” and run in time polynomial in the message length. – Construction...
متن کامل